Every Linear Threshold Function has a Low-Weight Approximator
نویسندگان
چکیده
منابع مشابه
Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold
We prove a surprising lower bound for resource augmented nonclairvoyant algorithms for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of average response time. Edmonds in STOC99 shows that the algorithm Equi-partition is a (2+ǫ)-speed Θ( ǫ )-competitive algorithm. We define its speed threshold to be 2 because it is constant competitive whe...
متن کاملEvery Low 2 Boolean Algebra Has a Recursive Copy
The degree of a structure si is the Turing degree of its open diagram £»(j/) , coded as a subset of a>. Implicit in the definition is a particular presentation of the structure; the degree is not an isomorphism invariant. We prove that if a Boolean algebra si has a copy of low 2 degree, then there is a recursive Boolean algebra 33 which is isomorphic to si . This builds on work of Downey and Jo...
متن کاملEvery Body Has a Brain
[1] http://ebhb.morphonix.com/ [2] http://fireflyfoundation.wordpress.com/brain-games/every-body-has-a-brain/ [3] http://dev.cdgr.ucsb.edu/organizations/morphonix [4] http://dev.cdgr.ucsb.edu/category/genre/educational [5] http://dev.cdgr.ucsb.edu/category/genre/music/dance [6] http://dev.cdgr.ucsb.edu/category/topics/anatomy [7] http://dev.cdgr.ucsb.edu/category/topics/brain [8] http://dev.cdg...
متن کاملCharacterizing a Brain-Based Value-Function Approximator
The field of Reinforcement Learning (RL) in machine learning relates significantly to the domains of classical and instrumental conditioning in psychology, which give an understanding of biology’s approach to RL. In recent years, there has been a thrust to correlate some machine learning RL algorithms with brain structure and function, a benefit to both fields. Our focus has been on one such st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2007
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-007-0228-7